Method, computer program, and system for automated real-time signal analysis for detection, quantification, and prediction of signal changes

ABSTRACT

A method, computer program, and system for real-time signal analysis providing characterization of temporally-evolving densities and distributions of signal features of arbitrary-type signals in a moving time window by tracking output of order statistic filters (also known as percentile, quantile, or rank-order filters). Given a raw input signal of arbitrary type, origin, or scale, the present invention enables automated quantification and detection of changes in the distribution of any set of quantifiable features of that signal as they occur in time. Furthermore, the present invention&#39;s ability to rapidly and accurately detect changes in certain features of an input signal can also enable prediction in cases where the detected changes associated with an increased likelihood of future signal changes.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation application of Ser. No. 09/824,946, filed Apr. 3, 2001, now U.S. Pat. No. 6,768,969 which is hereby incorporated into the present application by reference.

The present application relates to and claims priority with regard to all common subject matter of a first provisional patent application titled “Methods for Signal Analysis, Order Statistic Signal Normalization, and Analog Implementation of Order Statistic Filters”, Ser. No. 60/194,130, filed Apr. 3, 2000. The identified first provisional patent application is hereby incorporated into the present application by reference.

The present application also relates to and claims priority with regard to all common subject matter of a second provisional patent application titled “Methods for Analysis and Comparison of Continuous Variables”, Ser. No. 60/223,206, filed Aug. 8, 2000. A copy of the identified second provisional patent application is submitted herewith and hereby incorporated into the present application by reference.

The U.S. Government has a paid-up license in this invention and the right in limited circumstances to require the patent owner to license others on reasonable terms as provided for by the terms of Grant No. 5R44NS34630-03 awarded by the National Institutes of Health/National Institute of Neurological Disorders and Stroke (NINDS).

COMPUTER PROGRAM LISTING APPENDIX

A computer program listing appendix containing the source code of a computer program that may be used with the present invention is incorporated herein by reference and appended to application Ser. No. 09/824,946 as one (1) original compact disk, and an identical copy thereof, containing a total of forty-one (41) files as follows:

Filename Date of Creation Size (Bytes) AMPLDIST.M Mar. 12, 1999 12:23p 2,736 APTF.C Aug. 06, 1999 12:33p 8,146 DIGITI˜1.C Jun. 26, 1999 02:38p 5,520 DIGITI˜1.M Jun. 26, 1999 02:39p 627 DISTR1D.M Jun. 17, 1999 12:45p 3,984 DISTR2D.M Jun. 26, 1999 02:40p 5,702 DISTRI˜1.C Oct. 13, 1999 02:24p 8,218 EST_ER˜1.M Mar. 27, 2001 04:34p 330 FGTOBG˜1.C Oct. 22, 1999 09:45a 9,730 FGTOBG˜2.C Oct. 22, 1999 10:15a 9,917 KSEEG2.C Oct. 22, 1999 11:59a 6,606 KSSAPP˜1.C Oct. 19, 1999 03:32p 11,997 LOCATE.M Jul. 16, 1999 10:02a 542 PTCFIL˜1.C Aug. 04, 1999 08:42a 8,707 PTCFIL˜1.M Jul. 24, 1999 10:42a 935 PTF.C Oct. 06, 1999 12:22p 7,337 PTF1.M Sep. 07, 2000 01:32p 847 PTF2.M Sep. 07, 2000 01:33p 734 PTFHIL˜1.C Oct. 06, 1999 04:08p 7,361 PTFILTER.C Aug. 04, 1999 08:43a 7,481 PTFILTER.M Jul. 24, 1999 10:48a 801 PTFSQR.C Oct. 15, 1999 11:56a 6,901 PTF_CHI.CPP Feb. 14, 2001 05:58p 3,829 PTF_CHI.M Feb. 13, 2001 06:02p 477 PTF_DEMO.M Apr. 02, 2001 12:32a 1,101 PTF_NOR.CPP Feb. 16, 2001 05:26p 3,618 PTF_NOR.M Nov. 20, 2000 01:28p 532 PTF_TRI.CPP Mar. 05, 2001 01:12p 3,387 PTF_TRI.M Feb. 16, 2001 05:33p 548 PTF_UNI.CPP Feb. 20, 2001 06:47p 3,110 PTF_UNI.M Oct. 30, 2000 11:25a 451 QKS.C Oct. 11, 1999 02:16p 3,959 REXPMEAN.C Aug. 09, 1999 11:40a 3,544 RMEAN.C Sep. 13, 1999 01:48p 3,532 RMEAN.M Jul. 27, 1999 03:35p 588 RMEANM˜1.C Sep. 13, 1999 09:10p 5,464 THRESH˜1.C Jul. 06, 1999 11:11a 8,932 THRESH˜1.M Mar. 03, 1999 04:50p 1,028 THRESH˜2.M Mar. 04, 1999 12:00p 3,218 THRESH˜3.M Jun. 16, 1999 06:03p 1,386 UNI_2_˜1.M Mar. 05, 2001 01:27p 417

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates generally to methods, computer programs and systems for automated signal analysis providing rapid and accurate detection, prediction, or quantification of changes in one or more signal features, characteristics, or properties as they occur. More particularly, the present invention relates to a method, computer program, or system for automated real-time signal analysis providing characterization of temporally-evolving densities and distributions of signal features of arbitrary-type signals in a moving time window by tracking output of order statistic filters (also known as percentile, quantile, or rank-order filters).

2. Description of the Prior Art

It is often desirable to detect and quantify feature changes in an evolving signal, and there have been numerous attempts to develop automated signal analysis means operable to do so. One well-known approach, for example, is based upon analysis of the signal's mean value, which is typically a well known, well understood, and easily computed property. Other well-known techniques look for changes in signal variance or standard deviation over time.

Unfortunately, these commonly used approaches have significant drawbacks, including lack of robustness in the presence of signal outliers. Furthermore, in all but a few ideal cases, monitoring these individual parameters does not enable detection of all types of changes in feature distribution. This is because the mean and standard deviation rarely completely describe the signal distribution. Another problem that plagues many existing analysis techniques is that they are unable to deal adequately with real-world problems in which the analyzed signal is often highly complex, non-stationary, non-linear, and/or stochastic.

Another well-known approach, one more suited to practical situations than the above-mentioned methods, uses order statistics (e.g., the median or other percentile or quantile values). Order statistics are advantageous because they are directly related to the underlying distribution and are robust in the presence of outliers. For example, a method of signal analysis that enables the detection of state changes in the brain through automated analysis of recorded signal changes is disclosed in U.S. Pat. No. 5,995,868. This method addresses the problem of robustness in the presence of outliers through novel use of order-statistic filtering. Additionally, given information from a moving time window of a certain time scale, referred to as the “foreground”, this method provides for real-time comparison thereof with a reference obtained from past data derived, e.g., from a longer time scale window, referred to as the “background.” This approach thereby addresses some of the normalization problems associated with complex, non-stationary signals.

Although the prior invention disclosed in U.S. Pat. No. 5,995,868 has successfully addressed many of the above-mentioned limitations, including normalization problems associated with complex non-stationary signals, it is lacking in breadth of scope. Detection of changes, for example, is limited to a particular order statistic of the signal. Additionally, the order statistic filter employed to detect signal changes requires large amounts of processing ability, memory, and power when used on digital signals for which sorting procedures are performed at each point in time. Furthermore, the method does not enable full analog implementation.

Most work on order statistic filters, such as median filters, and their implementation is in the areas of digital signal and image processing, which, as mentioned, requires large amounts of processing ability, memory, and power not practical or cost-effective for some applications. Work on analog median filters is limited to situations where the input is provided as parallel lines of data, and a program or circuit that implements the filter outputs a value that is equal to the median of the data on different input lines. Work on analog median filtering for continuous-time signals is not extensive, and no realizable implementations exist able to track a percentile (e.g., median) of a continuous-time signal. One reason for this is that the operation of finding the rank or order is non-linear, making modeling the procedure using an ordinary differential equation so complicated that it has not yet been addressed.

Due to the above-described and other problems, a need exists for a more general, powerful, and broad method for automated analysis of signals of any degree of complexity and type.

SUMMARY OF THE INVENTION

The present invention solves the above-described and other problems to provide a distinct advance in the art of automated signal analysis. More specifically, the present invention comprises a method, computer program, and system for real-time signal analysis providing characterization of temporally-evolving densities and distributions of signal features of arbitrary-type signals in a moving time window by tracking output of order statistic filters (also called percentile, quantile, or rank-order filters).

The present invention is operable to analyze input signals of arbitrary type, origin and scale, including, for example, continuous-time or discrete-time, analog or digital, scalar or multi-dimensional, deterministic or stochastic (i.e., containing a random component), stationary (i.e., time invariant) or non-stationary (i.e., time varying), linear or nonlinear. Thus, the present invention has broad applicability to analysis of many different types of complex signals and sequences of data, including but not limited to biological signals such as those produced by brain, heart, or muscle activity; physical signals such as seismic, oceanographic, or meteorological; financial signals such as prices of various financial instruments; communication signals such as recorded speech or video or network traffic signals; mechanical signals such as jet engine vibration; target tracking and recognition; signals describing population dynamics, ecosystems or bio-systems; signals derived from manufacturing or other queuing systems; chemical signals such as spectroscopic signals; and sequences of data such as word lists, documents, or gene sequences. Furthermore, the present invention is applicable to any set of signal features so long as they are quantifiable, thereby allowing for a high degree of system adaptability and selectivity.

Thus, the present invention enables automated detection and quantification of changes in the distribution of any set of quantifiable features of a raw input signal as they occur in time. The input signal, denoted as {x(t)}, can be any data parameterized by a real-valued variable, t, which will be interpreted as a time variable. The input signal may be optionally preprocessed in order to produce a new signal, the feature signal, denoted as {X(t)}. {X(t)} quantifies a set of features of the input signal that the system will use in detecting and quantifying changes. For a fixed t, X(t) is called the signal feature vector at time t. The feature vector has as many components as there are signal features. While potentially of substantial value, this preprocessing step is optional in the sense that the raw input signal itself may be used as the feature vector (i.e., X(t)=x(t)), in which case the invention proceeds to detect changes in the distribution of the raw input signal as it evolves in time. The desirability of preprocessing will depend upon the nature of the raw input signal and the nature of the features of interest.

The present invention also introduces a useful new object called the time-weighted feature density of a signal, {ƒ(t,X)}, which can be computed from the feature signal at each point in time. This object allows access to estimates of the full time-dependent density and cumulative distribution function of varying signal features with any desired degree of accuracy, but confines these estimates to any desired time-scale through the use of time-weighting (time localization of feature density). This time-weighted feature density describes the raw input signal features measured in moving windows of time specified by the time-weight function, which allows a user to apply different significances to portions of available information (e.g., to consider recent information as more relevant than older information; or to weight information according to its reliability, etc.).

Moreover, the present invention allows for rapidly obtaining these estimates in a computationally efficient manner that can be implemented in digital or analog form, and a method for detecting, quantifying, and comparing changes of arbitrary type in the density/distribution of the feature vector as it changes. The significance of this increase in computational efficiency, along with analog implementability, becomes especially clear when considering medical device applications where, for example, the present invention enables currently used eternally-worn devices that require daily battery recharging to become fully implantable devices with an operational lifetime of several years, thereby improving safety and convenience.

In operation, a raw time-varying input signal of arbitrary type, origin, and scale is received for analysis. Optionally, depending upon the nature of the raw input signal and the nature of the features of interest, pre-processing occurs to produce a feature signal more amenable to further analysis. Next, time-weighted density or distribution functions are determined for both a foreground or current time window portion of the signal and a background portion of the signal or reference signal (which also may be evolving with time, but potentially on a different timescale) in order to emphasize, as desired, certain data.

Percentile values for both foreground and background signals are then accurately estimated and compared so as to detect and quantify feature changes on any timescale and to any desired degree of precision as the raw input signal evolves in time. Density and distribution approximations may also be compared. As noted above, the state of the existing art requires that the data be laboriously sorted in order to determine these percentile values. In the present invention, however, percentile values are accurately estimated without sorting or stacking, thereby increasing processing speed and efficiency while reducing computation, memory, and power needs. Thus, the present invention is able to perform in a highly computationally efficient manner that can be implemented in a low power consumption apparatus consisting of an analog system, a digital processor, or a hybrid combination thereof, thereby providing tremendous system power savings.

The present invention is also operable to facilitate real-time signal normalization with respect to the density/distribution approximations, which is useful in processing and analysis of series of different orders. This is particularly useful where the features or characteristics of interest are invariant to a monotonic transformation of the signal's amplitude.

It will also be appreciated that the present invention's ability to rapidly and accurately detect changes in certain features of the input signal can enable prediction in cases where the changes it detects are associated with an increased likelihood of future signal changes. For example, when applied to seismic signals, the method can enable prediction of an earthquake or volcanic eruption; when applied to meteorological signals, the method can enable prediction of severe weather; when applied to financial data, the method can enable prediction of an impending price change in a stock; when applied to brain waves or heart signals, the method can enable prediction of an epileptic seizure or ventricular fibrillation; and when applied to brain wave or electromyographic signals, it can enable prediction of movement of a body part.

These and other novel features of the present invention are described in more detail herein below.

BRIEF DESCRIPTION OF THE DRAWING FIGURES

The present invention is described in detail below with reference to the attached drawing figures, wherein:

FIG. 1 is a block diagram illustrating a first portion of steps involved in performing a preferred embodiment of the present invention;

FIG. 2 is a block diagram illustrating a second portion of steps involved in performing a preferred embodiment of the present invention;

FIG. 3 is a block diagram illustrating a third portion of steps involved in performing a preferred embodiment of the present invention;

FIG. 4 is a graph of an exemplary raw input signal, x(t), as might be received for analysis by a preferred embodiment of the present invention;

FIG. 5 is a graph of a feature signal, X(t), resulting from preprocessing the raw input signal shown in FIG. 4;

FIG. 6 is a graph showing the calculated 0.25, 0.50, and 0.75 percentiles of the feature signal shown in FIG. 5;

FIG. 7 is a graph showing the true feature density, ƒ(t,w) of the feature signal shown in FIG. 5 calculated at times t₁ and t₂;

FIG. 8 is a graph showing the true feature distribution, F(t,w), of the feature signal shown in FIG. 5 calculated at times t₁ and t₂;

FIG. 9 shows a graph of an evolving first approximation of the time-weighted feature density of the feature signal shown in FIG. 5, calculated at times t₁ and t₂;

FIG. 10 shows a graph of an evolving first approximation of the time-weighted distribution function of the feature signal shown in FIG. 5, calculated at times t₁ and t₂;

FIG. 11 is a graph showing calculated percentile tracking filter outputs for 0.25, 0.50, and 0.75 percentiles of the feature signal shown in FIG. 5;

FIG. 12 shows a graph of an evolving second approximation of the time-weighted feature density of the feature signal shown in FIG. 5, calculated at times t₁ and t₂;

FIG. 13 shows a graph of an evolving second approximation of the time-weighted distribution function of the feature signal shown in FIG. 5, calculated at times t₁ and t₂;

FIG. 14 shows a graph of a Λ(t) measured from the feature signal shown in FIG. 5;

FIG. 15 is a block diagram of a preferred embodiment of an analog implementation of a percentile tracking filter component of the present invention;

FIG. 16 is a detailed circuit schematic of the percentile tracking filter component shown in FIG. 15;

FIG. 17A shows an exemplary feature signal that for analysis by the present invention;

FIG. 17B shows an output of the detailed circuit schematic shown in FIG. 16 and a true median output associated with the feature signal of FIG. 17A;

FIG. 18 is a block diagram of a preferred embodiment of an analog implementation of a Lambda estimator component of the present invention; and

FIG. 19 is a detailed circuit schematic of the Lambda estimator component shown in FIG. 18.

DETAILED DESCRIPTION OF A PREFERRED EMBODIMENT

The present invention comprises a method, computer program, and system for real-time signal analysis providing characterization of temporally-evolving densities and distributions of signal features of arbitrary-type signals in a moving time window by tracking output of order statistic (e.g., percentile, quantile, rank-order) filters. More specifically, given a raw input signal of arbitrary type, origin, and scale, the present invention enables automated quantification and detection of changes in the distribution of any set of quantifiable features of that signal as they occur in time. Furthermore, the present invention's ability to rapidly and accurately detect changes in certain features of an input signal can also enable prediction in cases when the detected changes are associated with an increased likelihood of future signal changes.

Method

Step 1: Receive Raw Input Signal

Referring to FIG. 1, the raw input signal is received from a system under study 22. This signal, denoted as {x(t)}, can be any data parameterized by a real-valued variable, t, which will be interpreted as a time variable. As noted, the raw input signals may be of arbitrary type, including, for example, continuous-time or discrete-time, analog or digital, scalar or multi-dimensional, deterministic or stochastic (i.e., containing a random component), stationary (i.e., time invariant) or non-stationary (i.e., time varying), and linear or nonlinear. The raw input signals may also be of arbitrary origin, including, for example, biological signals such as those produced by brain, heart, or muscle activity; financial signals such as prices of various financial instruments; physical signals such as seismic, oceanographic, and meteorological; communication signals such as recorded speech or video or network traffic signals; mechanical signals such as jet engine vibration; chemical signals such as those obtained in spectroscopy; and sequences of data such as word lists or gene sequences.

Step 2: (Optional) Preprocess Raw Input Signal to Derive Feature Signal

The raw input signal may be optionally pre-processed, as shown in box 24, in order to produce a new signal, the feature signal, denoted as {X(t)}. One skilled in the art will appreciate that there exist a nearly endless set of transformations that can be applied to the raw input signal, x(t), to quantify various features, characteristics, or properties of the signal as it evolves. Common examples include derivatives of any order; integrals or any order; various moments and related properties such as variance, skewness, kurtosis; wavespeed and related measures such as inter-zero-crossing intervals and inter-peak intervals; signal power in a time window and/or in a particular frequency band; measures derived from Fourier analysis such as those involving signal phase or power spectral density; measures from nonlinear dynamics such as correlation dimension, fractal dimension, magnitude of Lyapunov exponents; phase delay embeddings; and measures of rhythmicity, wave shape, or amplitude.

The feature signal, {X(t)}, quantifies a set of features of the input signal that the system will use in detecting changes. For a fixed t, X(t) is called the signal feature vector at time t. The feature vector has as many components as there are signal features. While potentially of substantial value, this pre-processing step is optional in the sense that the raw input signal itself may be used as the feature vector (i.e., X(t)=x(t)), in which case the invention proceeds to detect changes in the distribution of the raw signal as it evolves in time. The desirability of preprocessing will depend upon the nature of the raw input signal and the nature of the features of interest.

Step 3: Determine Time-Weighted Distribution and Density Functions of the Feature Signal

A time-weighted feature density (TWFD) of a signal, {ƒ(t,X)}, is computed from the raw input signal or feature signal at each point in time, as shown in box 26. The TWFD allows access to estimates of the full time-dependent density and cumulative distribution functions of varying signal features with any desired degree of accuracy, but confines these estimates to any desired time-scale through the use of time-weighting (time localization of feature density). Time-weighting allows the user to apply different significance to portions of available information (e.g., to consider more recent information as more relevant than older information; or to weigh information according to its reliability, etc.).

Thus, the TWFD describes the raw input signal features measured in moving windows of time specified by a time-weight function, thereby allowing for detection, quantification, and comparison of changes of arbitrary type in the density/distribution of the feature vector as it evolves.

The instantaneous feature density of a signal, X, at time t is defined as ƒ(t,D)=δ[D−X(t)],  (1) where δ(x) is the Dirac δ-function, and D is a variable signal level. This density is just a δ-function at the signal's present value.

The concept of instantaneous feature density can then be extended to a time-weighted window. The TWFD of the feature signal X(t) in a time window w(t,s) is defined as $\begin{matrix} {{{f\left( {t,D} \right)} = {\int_{- \infty}^{\infty}{{w\left( {t,s} \right)}{\delta\left\lbrack {D - {X(s)}} \right\rbrack}{\mathbb{d}s}}}},} & (2) \end{matrix}$ where δ(x) is the Dirac δ-function, D is the amplitude, and the weighting function, w(t,s), often called a “time-weight,” is any function such that $\begin{matrix} {{\int_{- \infty}^{\infty}{{w\left( {t,s} \right)}{\mathbb{d}s}}} = 1.} & (3) \end{matrix}$ Typically, w(t,s)≧0 for all t,s. Also, in most practical applications, w will be “causal” meaning that w(t,s)=0 for all s>t. It should be noted that w(t,s) may attain its dependence upon t or s through an explicit dependence upon other signals (e.g., X(t), in which case it may be referred to as a “state-weight”).

When w(t,s)=w(t−s), Eq. (2) becomes a convolution integral, and the time-weighting function is interpreted as a moving window. If T is a characteristic time, or duration of w, the dependence may be expressed as w(t,s; T), and a shorthand notation used for the integral $\begin{matrix} {{\int_{- \infty}^{\infty}{{w\left( {{t - s};T} \right)}\quad\ldots\quad{\mathbb{d}s}}} = {\left\langle \ldots \right\rangle_{T}.}} & (4) \end{matrix}$

Eq. (4) defines a time average on a time scale T. In the notation, w(t,s; T), the independent variable, s, is used as the domain of the function, the independent variable, t, represents the current time, and is used to parameterize the choice of w, enabling the time window to change or move as time changes or evolves. This dependence on t also allows the user to change the shape of time-weighting as t changes. Moreover, the time scale can vary with time (i.e., T=T(t)). The weight function may also depend upon other information besides time (e.g., the raw signal, the feature signal, signals derived from the feature signal (such as it's time derivatives), other “auxiliary” signals, S(t), or control signals, U(t)). This generalization allows for state-weighting as mentioned above, or to, e.g., include other “outside” information into the analysis, emphasizing feature signal information accordingly.

ƒ(t,D) of Eq. (2) reduces to the instantaneous density defined by Eq. (1) when w(t,s)=δ(t−s). The notation of Eq. (4) may be used for both continuous and discrete time averages.

For example, the time window may be a rectangular moving window of length T, such that $\begin{matrix} {{{w\left( {t,{s;T}} \right)} = {{w\left( {t - s} \right)} = {\frac{1}{T}{\theta\left\lbrack {\left( {T - \left( {t - s} \right)} \right)\left( {t - s} \right)} \right\rbrack}}}},} & (5) \end{matrix}$ where θ(x) is the Heaviside step function, it results that $\begin{matrix} {{f\left( {t,{D;w}} \right)} = {\left\langle {\delta\left\lbrack {D - {X(s)}} \right\rbrack} \right\rangle_{T} = {\frac{1}{T}{\int_{t - T}^{t}{{\delta\left\lbrack {D - {X(s)}} \right\rbrack}{{\mathbb{d}s}.}}}}}} & (6) \end{matrix}$

In another example, the time window may be an exponential moving window with time constant T, such that $\begin{matrix} {{{w\left( {t,{s;T}} \right)} = {{w\left( {t - s} \right)} = {\frac{1}{T}{\exp\left( \frac{s - t}{T} \right)}{\theta\left( {t - s} \right)}}}},} & (7) \end{matrix}$ wherein it results that $\begin{matrix} {{f\left( {t,{D;w}} \right)} = {\left\langle {\delta\left\lbrack {D - {X(s)}} \right\rbrack} \right\rangle_{T} = {\frac{1}{T}{\int_{- \infty}^{t}{{\exp\left( \frac{s - t}{T} \right)}{\delta\left\lbrack {D - {X(s)}} \right\rbrack}{{\mathbb{d}s}.}}}}}} & (8) \end{matrix}$ This particular choice of weight is the preferred embodiment for all analog implementations because of its ease of use.

A time-weighted cumulative distribution function (TWCDF) of the feature signal, F(t,x;w), can now be derived. The TWCDF describes the distribution of the feature signal in a time window that is weighted according to the time-weight function, w (hence the notational dependence of F on w). This time-weight determines how information from the feature signal will contribute to the probability distribution, and is described in more detail below.

It will be appreciated that the TWFD can be obtained from the TWCDF by differentiation, and the TWCDF obtained from the TWFD via integration as follows:

 ƒ(t,x;w)=F _(x)(t,x;w),  (9)

$\begin{matrix} {{F\left( {t,{x;w}} \right)} = {\int_{- \infty}^{x}{{f\left( {t,{y;w}} \right)}{{\mathbb{d}y}.}}}} & (10) \end{matrix}$

It is easy to see from Eq. (10) and the well known identities relating the Dirac δ-function and Heaviside functions: $\begin{matrix} {{{\theta(x)} \equiv {\int_{- \infty}^{x}{{\delta(s)}{\mathbb{d}s}}}},{and}} & (11) \\ {{{\delta(x)} = {\frac{\mathbb{d}\quad}{\mathbb{d}x}{\theta(x)}}},} & (12) \end{matrix}$ that all equations for feature densities (Eqs. (2), (6), and (8) hold for cumulative distribution as well, provided that symbols “ƒ” and “δ” in these equations are replaced by “F” and “θ”, respectively.

As will be appreciated by one with ordinary skill in the art, percentile values are the very building blocks of probability distributions and enable a robust statistical description thereof. In many applications they produce significantly better information than other more commonly utilized statistics such as the mean and standard deviation. The set of all percentile values completely describes the distribution from which they are derived.

Given any number pε[0,1], the p^(th) percentile, X_(p)(t), of the TWCDF, F(t,x; w) is defined implicitly by the equation F(t,X _(p)(t;w);w)=p.  (13) Differentiating the above equation with respect to t, we see that F _(t)(t,X _(p))+F _(X)(t,X _(p)){dot over (X)} _(p)(t)=0  (14)

In the above equation, F_(t) and F_(X) denote the partial derivatives of F with respect to t and X, respectively. Rearranging terms results in $\begin{matrix} {{{\overset{.}{X}}_{p}(t)} = {- {\frac{F_{t}\left( {t,X_{p}} \right)}{F_{X}\left( {t,X_{p}} \right)}.}}} & (15) \end{matrix}$

The denominator of the above equation is the probability density function, ƒ(t,X; w), referred to as the “time-weighted feature density.” Thus, $\begin{matrix} {{{{\overset{.}{X}}_{p}(t)} = {- \frac{F_{t}\left( {t,X_{p}} \right)}{f\left( {t,X_{p}} \right)}}};{{X_{p}(0)} = {{X(0)}.}}} & (16) \end{matrix}$

The solution to this important differential equation is the p^(th) percentile, X_(p)(t). In other words, X_(p)(t) is the p^(th) percentile of the time-varying cumulative distribution function, F(t,X;w), generated by the variations of the feature signal, X(t), in the temporal window defined by w.

In most practical applications, the TWCDF will not be known (or immediately available for on-line use) at each moment in time and will instead need to be approximated from available information.

One method of estimating the TWCDF (or the corresponding TWFD) is accomplished by partitioning the state space (containing the range of the feature signal) and computing time-weighted histograms that keep track of how often each bin is visited by the feature signal. This non-parametric approach to obtaining {circumflex over (F)}(t,x;w) has the advantage (over the parametric approach described later herein) of allowing greater flexibility in approximating the TWCDF with any level of precision desired (although as precision improves, complexity of the implementation increases).

The feature density for discrete (digitally sampled) data can be computed in finite differences as follows (suppressing dependence on w): $\begin{matrix} \begin{matrix} {{\hat{f}\left( {t,D_{j}} \right)} = {\frac{1}{D_{j + 1} - D_{j - 1}}\left\lbrack {{\hat{F}\left( {t,D_{j + 1}} \right)} - {\hat{F}\left( {t,D_{j - 1}} \right)}} \right\rbrack}} \\ {{= \frac{1}{D_{j + 1} - D_{j - 1}}}\left\langle {\theta\left\{ {\left\lbrack {D_{j + 1} - {X(s)}} \right\rbrack\left\lbrack {D_{j - 1} - {X(s)}} \right\rbrack} \right\}} \right\rangle_{T}} \end{matrix} & (17) \\ {\quad{{{{or}\quad{\hat{f}}_{ij}} = {{\hat{f}\left( {t_{i},D_{j}} \right)} = {\sum\limits_{k}{w_{i - k}\theta_{ij}\quad{where}}}}}\quad{{w_{i - k} = {\frac{1}{2}\left( {t_{i + 1} - t_{i - 1}} \right){w\left( {t_{i} - t_{k}} \right)}}},\quad{and}}\quad\quad{\theta_{ij} = {{\theta\left( {\left( {D_{j + 1} - {X\left( t_{i} \right)}} \right)\left( {D_{j - 1} - {X\left( t_{i} \right)}} \right)} \right)}.}}}} & (18) \end{matrix}$

When the discrete character of the data is not intrinsic but a result of sampling and digitization of a continuous signal, then some kind of interpolation between the consecutive data points can often be appropriate. Then the identity $\begin{matrix} {{\delta\left\lbrack {a - {f(x)}} \right\rbrack} = {\sum\limits_{i}\frac{\delta\left( {x - x_{i}} \right)}{{f^{\prime}\left( x_{i} \right)}}}} & (19) \end{matrix}$ can be utilized to compute the feature density. In Eq. (19), |ƒ′(x)| denotes the absolute value of the function derivative with respect to x and the sum goes over all x_(i) such that ƒ(x_(i))=a. For example, if linear interpolation is adequate, one can use w_(i−k)=(t_(i+1)−t_(i))w(t_(i)−t_(k)), and $\begin{matrix} {\theta_{ij} = \left\{ \begin{matrix} 1 & {if} & {{D_{j} \leq {X\left( t_{i} \right)} < D_{j + 1}},{D_{j} \leq {{X\left( t_{i + 1} \right)}D_{j + 1}}}} \\ \frac{D_{j + 1} - D_{j}}{{{X\left( t_{i + 1} \right)} - {X\left( t_{i} \right)}}} & {if} & {{{X\left( t_{i} \right)} < D_{j}},{{X\left( t_{i + 1} \right)} \geq D_{j + 1}}} \\ \frac{{X\left( t_{i + 1} \right)} - D_{j}}{{X\left( t_{i + 1} \right)} - {X\left( t_{i} \right)}} & {if} & {{{X\left( t_{i} \right)} < D_{j}},{D_{j} \leq {X\left( t_{i + 1} \right)} < D_{j + 1}}} \\ \frac{D_{j + 1} - {X\left( t_{i} \right)}}{{X\left( t_{i + 1} \right)} - {X\left( t_{i} \right)}} & {if} & {{D_{j} \leq {X\left( t_{i} \right)} < D_{j + 1}},{{X\left( t_{i + 1} \right)} \geq D_{j + 1}}} \\ \frac{D_{j + 1} - {X\left( t_{i + 1} \right)}}{{X\left( t_{i} \right)} - {X\left( t_{i + 1} \right)}} & {if} & {{{X\left( t_{i} \right)} \geq D_{j + 1}},{D_{j} \leq {X\left( t_{i + 1} \right)} < D_{j + 1}}} \\ \frac{{X\left( t_{i} \right)} - D_{j}}{{X\left( t_{i} \right)} - {X\left( t_{i + 1} \right)}} & {if} & {{D_{j} \leq {X\left( t_{i} \right)} < D_{j + 1}},{{X\left( t_{i + 1} \right)} < D_{j}}} \end{matrix} \right.} & (20) \end{matrix}$

In order to compute the approximation to the cumulative distribution, the following formula may be used: $\begin{matrix} {{{\hat{F}\left( {t,D} \right)} = {\sum\limits_{i = 0}^{N - 1}\quad{\left\lbrack {{{\hat{F}}_{i}(t)} + {\left\lbrack {{{\hat{F}}_{i + 1}(t)} - {\hat{F}(t)}} \right\rbrack\frac{D - D_{i}}{D_{i + 1} - D_{i}}}} \right\rbrack{\theta\left\lbrack {\left( {D - D_{i}} \right)\left( {D_{i + 1} - D} \right)} \right\rbrack}}}},} & (21) \end{matrix}$ where {circumflex over (F)}_(i)(t)=θ[D_(i)−X(s)]_(T), and D_(O) and D_(N) are such that {circumflex over (F)}_(O)(t)=0 and {circumflex over (F)}hd N(t)=1, respectively (i.e., selected so that the signal never goes outside the interval [D_(O), D_(N)]). It will be appreciated that the cumulative distribution function approximation obtained using by Eq. (21) is a continuous function of D. It will also be appreciated that, for a given s, θ[D_(i)−X(s)] need not be evaluated at each D_(i). Instead, a binary search can be used to find i such that D_(i)≦X(s)<D_(i+1).

Another method of estimating the TWCDF (or the corresponding TWFD) is accomplished by approximating F(t,x;w) by a model distribution function, {tilde over (F)}(t,x;w,v(t)), that may depend upon a vector of parameters, v(t). Some typical examples include a Gaussian (normal), or chi-squared distribution with v(t)=[μ(t)σ(t)], (the mean and standard deviation); a uniform distribution with v(t)=[a(t)b(t)] (the left and right endpoints); a triangular distribution with v(t)=[a(t)b(t)c(t)] (the left, vertex, and right endpoints of the density, respectively); or an exponential distribution with v(t)=λ(t), the inverse of the distribution's mean.

An estimate, {circumflex over (v)}(t), may then be obtained of the parameter vector, v(t), from information available up to time t. This facilitates a “parametric” estimate of {circumflex over (F)}(t,x;w)={tilde over (F)}(t,x;w,{circumflex over (v)}(t)), by substituting the present parameter estimate into the model distribution.

The true feature density is typically unavailable for online analysis but may be well-approximated, assuming the distribution is well-modeled by a parametric distribution, through estimation of the parameters upon which the distribution depends. Often the moments of the distribution may be computed and used as input to the model to determine the approximation.

For example, a Gaussian approximation can be achieved using the first two moments (the mean, μ, and the variance, σ) of the feature signal. More precisely, the model density $\begin{matrix} {{\overset{\sim}{f}\left( {t,{x;T},\left\lbrack {\mu\quad\sigma} \right\rbrack} \right)} = {\frac{1}{\sqrt{2\quad\pi\quad\sigma}}{\exp\left\lbrack {- \frac{\left( {x - \mu} \right)^{2}}{2\sigma}} \right\rbrack}}} & (22) \end{matrix}$ is used, along with the parameter estimators {circumflex over (v)}(t)=[{circumflex over (μ)}(t){circumflex over (σ)}(t)]=[<X> _(T) <X> _(T) ²−(<X> _(T))²],  (23) to obtain {circumflex over (ƒ)}(t,x;T)={tilde over (ƒ)}(t,x;T,{circumflex over (v)}(t)).  (24)

Similarly other parametric approximations for data may be used, such as uniform or triangular distributions. Though the true distribution of the data is not exactly known, approximations work well because the algorithm tracks the percentile at each instant in real time. The uniform and triangular distributions have the advantage of stability, faster processing, and, most importantly, ease of hardware implementation over others that involve exponentiation. The presence of the exponential function for Gaussian and Chi-squared distributions (for absolutely positive data) increases computation in software and complexity of hardware, but may also be used. The uniform distribution model reduces the complexity of implementing circuitry by an order of magnitude. This reduction is significant in reducing the size and power requirement of the circuit and significantly improves scope for miniaturization and possible embedded applications. Further, the uniform distribution makes the implementation stable, unlike the Gaussian approximation which requires signal limiting (clipping) to prevent output from becoming unbounded due to the exponential function. Similarly, the use of a triangular distribution model for data that is strictly positive simplifies the implementation (assuming the left end and vertex of the density are at x=0, the distribution is completely specified by the right endpoint, i.e., the maximal x value). The triangular distribution approximation can also be used to estimate the distribution of the signal from a single percentile calculation. One with ordinary skilled in the art will appreciate that similar parametric modeling and estimation may be performed using any other distribution model and parameter estimation scheme meant to approximate the underlying true density/distribution.

Step 4: Compute the Percentile Tracking Filter (PTF)

Once the TWCDF estimate, {circumflex over (F)}(t,x;w), has been obtained (and the TWFD estimate, {circumflex over (ƒ)}(t,x;w), is therefore also available), an estimator of X_(p)(t), referable to as the output of a percentile tracking filter (PTF) at time t, and denoted by {circumflex over (X)}_(p)(t), is obtained, as shown in box 28, from the differential equation $\begin{matrix} {{{{\overset{.}{\hat{X}}}_{p}(t)} = {- \frac{{\hat{F}}_{t}\left( {t,{\hat{X}}_{p}} \right)}{\hat{f}\left( {t,{\hat{X}}_{p}} \right)}}};{{{\hat{X}}_{p}(0)} = {{X(0)}.}}} & (25) \end{matrix}$

One with ordinary skill in the art will appreciate that p may denote a vector of percentile values, (i.e., p=[p₁ p₂ . . . p_(n)]) in which case {circumflex over (X)}_(p)(t) denotes the vector [{circumflex over (X)}_(p) ₁ (t) {circumflex over (X)}_(p) ₂ (t) . . . {circumflex over (X)}_(p) _(n) (t)].

In certain applications, it is desirable to know the value of X_(p)(t) such that F(t,X_(p);w)=p=constant. Thus, X_(p)(t) is an output of a rank-order (also order statistic, quantile, or percentile) filter. For example, X_(1/2)(t) is the output of a median filter, producing at each moment in time the median of the w-weighted distribution of feature signal information in the most recent window.

Numerical rank-order filtering is a computationally expensive operation. First, it requires knowing, at any given time, the values of N latest data points, where N is the length of the moving window, and the numerical and chronological order of these data points. This memory requirement is a major obstacle to implementing an analog order statistic filter. Another computational burden on different (numerical) rank-order filtering algorithms results from the necessity to update the numerically ordered/sorted list, i.e., to conduct a search. Overall performance of a rank-order filter is a trade-off between performance, speed, and memory requirements.

{circumflex over (X)}_(p)(t) is the p^(th) percentile of {circumflex over (F)}(t,x;w) in a moving window w(t,s;T)=w(t−s;T) if $\begin{matrix} {{{\hat{F}\left( {t,{{\hat{X}}_{p};T}} \right)} = {{\int_{- \infty}^{{\hat{X}}_{p}}{{\hat{f}\left( {t,{D;w}} \right)}\quad{\mathbb{d}D}}} = {{\int_{- \infty}^{\infty}{{w\left( {{t - s};T} \right)}{\theta\left\lbrack {{{\hat{X}}_{p}(t)} - {X(s)}} \right\rbrack}\quad{\mathbb{d}s}}} = p}}},} & (26) \end{matrix}$ where 0≦p≦1 is the percentile value. The time derivative of {circumflex over (X)}_(p) can now be computed as $\begin{matrix} {{{\overset{.}{\hat{X}}}_{p}(t)} = {{- \frac{{\hat{F}}_{t}\left( {t,{{\hat{X}}_{p};w}} \right)}{\hat{f}\left( {t,{{\hat{X}}_{p};w}} \right)}} = {{- \frac{1}{\hat{f}\left( {t,{{\hat{X}}_{p};w}} \right)}}{\int_{- \infty}^{\infty}{{\overset{.}{w}\left( {{t - s};T} \right)}{\theta\left\lbrack {{\hat{X}}_{p} - {X(s)}} \right\rbrack}\quad{{\mathbb{d}s}\quad.}}}}}} & (27) \end{matrix}$ Typically w(·) is chosen such that it vanishes at ±∞, and since ${{\overset{.}{w}\left( {t - s} \right)} = {{- \frac{\mathbb{d}\quad}{\mathbb{d}s}}{w\left( {t - s} \right)}}},$ integration of Eq. (27) by parts leads to $\begin{matrix} {{\overset{\overset{.}{\hat{}}}{X}}_{p}(t)} & = & {\frac{1}{\hat{f}\left( {t,{{\hat{X}}_{p};w}} \right)}{\int_{- \infty}^{\infty}{{w\left( {{t - s};T} \right)}\left\{ {{\overset{.}{X}(s)}{\delta\left\lbrack {{{\hat{X}}_{p}(s)} - {X(s)}} \right\rbrack}} \right\}{{\mathbb{d}s}.}}}} & (28) \\ \quad & = & {{\frac{1}{\hat{f}\left( {t,{{\hat{X}}_{p};w}} \right)}{\sum\limits_{i}{{w\left( {t - t_{i}} \right)}{{sign}\left\lbrack {\overset{.}{X}\left( t_{i} \right)} \right\rbrack}}}},} & (29) \end{matrix}$ where the sum goes over all t_(i) such that X(t_(i))=X_(p)(t), i.e., over all times of threshold crossings, using the identity of Eq. (19).

It will be appreciated that if w(·) has a shape that coincides with the impulse response of an analog filter, then the differential equation Eq. (27) can be solved in an analog circuit, provided that {circumflex over (ƒ)}(t,x;w) is evaluated in finite differences according to Eq. (17).

For example, where the time-weight function is a rectangular moving window of length T, $\begin{matrix} {{\overset{\overset{.}{\hat{}}}{X}}_{p} = {\frac{1}{T\quad{\hat{f}\left( {t,{{\hat{X}}_{p};T}} \right)}}{\left\{ {{\theta\left\lbrack {{\hat{X}}_{p} - {X\left( {t - T} \right)}} \right\rbrack} - {\theta\left\lbrack {{\hat{X}}_{p} - {X(t)}} \right\rbrack}} \right\}.}}} & (30) \end{matrix}$

The braced expression is merely the total number of upward crossings of the threshold, {circumflex over (X)}_(p)(t), by the signal minus the total number of downward crossings, in agreement with Eq. (29).

In another example, where the time-weight function is an exponential moving window of length T, $\begin{matrix} {{\overset{\overset{.}{\hat{}}}{X}}_{p} = {\frac{1}{T\quad{\hat{f}\left( {t,{{\hat{X}}_{p};T}} \right)}}{\left\{ {p - {\theta\left\lbrack {{\hat{X}}_{p} - {X(t)}} \right\rbrack}} \right\}.}}} & (31) \end{matrix}$

In this example p enters the equation for {circumflex over (X)}_(p)(t) explicitly rather than through the initial condition only, as in a general case of Eq. (27). The exponential window is causal, and has an advantageously low computational cost (including low memory requirements) and easy analog implementation. For these reasons this choice of weight function is preferred.

From the PTF output signal, {circumflex over (X)}_(p)(t), can be obtained another approximation, denoted as ${\overset{\hat{\hat{}}}{F}\left( {t,{x;w}} \right)},$ for the TWCDF (and TWFD) by standard interpolation or extrapolation means (e.g., linear interpolation and extrapolation to enable evaluation of the distribution function approximation at values between ordered pairs {({circumflex over (X)}_(p) _(i) (t),p),i=1 . . . n} that serve as nodes for the distribution approximation).

The PTF output (and the TWCDF estimates) make accessible important information about the level of quantified features present in the specialized time-window defined by the time-weight function. Prior to this invention, none of this information could be obtained in a completely analog system, and the computational cost of deriving this information in digital implementations was significantly more expensive and less efficient.

Step 5: (Optional) Normalize the Signal

The present invention facilitates an optional normalization technique which may be performed at this point, as shown in box 30. The desirability of performing this optional step will depend upon the nature of the signals of interest, particularly their respective scales.

Given any input signal, z(t), and any (possibly time-varying) cumulative distribution function, F(t,x), a new signal, y(t), may be obtained by evaluating the distribution function at the input signal value, i.e., y(t)=F(t,z(t)). This new signal may be referred to as the normalization of signal z with respect to the distribution F.

The signal, y(t), is deemed “normalized” because, no matter what the values/range taken by the input signal, the resulting signal values are always in the interval [0,1]. The flexibility of this normalization technique is that any distribution function and input signal may be utilized (provided only that F is defined so that its second argument is of the same dimension as the input signal), as well as the observation that, for a stationary distribution (i.e., F(t,x)≡F(x)) the procedure is a monotonic transformation of the input signal, make this a useful tool for signal analysis.

This normalization technique can be combined with the herein described techniques for approximating the TWCDF of a signal, to enable normalization of an input signal with respect to a time-weighted distribution function of the feature signal of the same (or a different) signal. More specifically, the combination of methods results in the normalized signals ${\hat{y}(t)} = {{{\hat{F}\left( {t,{{x(t)};w}} \right)}\quad{and}\quad{\overset{\hat{\hat{}}}{y}(t)}} = {{\overset{\hat{\hat{}}}{F}\left( {t,{{x(t)};w}} \right)}.}}$

This normalization technique (together with the method for detecting changes in a time-varying distribution function described elsewhere herein) has been successfully applied, for example, to the problem of automated speech recognition, accurately detecting each occurrence of a particular phoneme in digitally recorded speech.

Step 6: Compare Foreground and Background or Reference Distributions/Densities in Order to Detect and Quantify Changes in Signal Features

Referring to FIG. 2, the foreground signal and background or reference signal may now be compared in order to detect or quantify feature changes in the foreground signal. That is, the ability to extract information from (or restrict the influence of information to) different time scales through weighting functions, and the ability to precisely control the set of features under study, allows further use of feature density analysis method as a component of a system for detection and quantification of feature changes. Referring also to FIG. 3, such detection and quantification is accomplished by comparing the PTF outputs (or entire time-weighted feature densities) in the moving foreground window with that of a background or established reference from which a specified change is to be detected.

The method described thus far makes available TWCDF approximates and associated PTF signals for various percentiles. These are determined in part by the time-weight function used in their definition and computation, which describes the way information is weighted and utilized in the production of these approximations. These approximations can be further analyzed and utilized to produce new and highly valuable means for detection and quantification of changes in the feature signal, and therefore in the underlying system that provided the raw signal input.

Generally, the concept is one of comparison between results obtained for different time-weighting of the information provided by the percentile tracking filter outputs or approximations of the TWFD or corresponding TWCDF of the feature signal. One skilled in the art will appreciate that the user may specify two (or more) time-weight functions, w₁ and w₂, with different characteristic timescales, T₁ and T₂, respectively, and thereby obtain two sets of PTF outputs and TWCDF approximations: ${{{\hat{X}}_{p}\left( {t;w_{1}} \right)}\quad{and}\quad{{\hat{F}}_{1}\left( {t,{x;w_{1}}} \right)}},{{\overset{\hat{\hat{}}}{F}}_{1}\left( {t,{x;w_{1}}} \right)}$ corresponding to timescale T₁, and ${{{\hat{X}}_{p}\left( {t;w_{2}} \right)}\quad{and}\quad{{\hat{F}}_{2}\left( {t,{x;w_{2}}} \right)}},{{\overset{\hat{\hat{}}}{F}}_{2}\left( {t,{x;w_{2}}} \right)}$ corresponding to timescale T₂.

T₁ is preferably chosen to be much larger than T₂ so that a comparison may be performed of the above quantities, interpreting the former as representing the background or reference information (i.e., obtained from a large time window of past or historical information) and the latter set as being representative of the foreground or more current, test information (i.e., obtained from a small time window of recent information). The existence of a reference for the comparison allows a built-in type of normalization that ensures comparison of “apples to apples” in the resulting analysis. The reference information need not necessarily be continually updated (the time between updates could, e.g., be proportional to the timescale analyzed), or a constant set of information (e.g., a constant, C, and fixed distribution, F_(ref)(t,x)) may be used as a reference for the comparison with ${{\hat{X}}_{p}\left( {t;w_{2}} \right)}\quad{and}\quad{{\hat{F}}_{2}\left( {t,{x;w_{2}}} \right)}\quad{or}\quad{{\overset{\hat{\hat{}}}{F}}_{2}\left( {t,{x;w_{2}}} \right)}$ respectively. One skilled in the art will recognize that any of the standard techniques for statistical analysis of data and for comparison of distributions or densities can also now be applied for time-dependent quantification of the signal and its changes.

The wealth of comparisons that may be performed between the PTF outputs are well known to those skilled in the art of signal analysis. Although such outputs were not available prior to the present invention, there are numerous known techniques for comparison of test signals to reference signals that may be employed to these newly available PTF outputs. A typical example (utilizing the type of comparison employed in the successful detection algorithm disclosed in U.S. Pat. No. 5,995,868) involves computing a ratio of the foreground and background outputs, e.g., $\begin{matrix} {{{r(t)} = \frac{{\hat{X}}_{p}\left( {t;w_{2}} \right)}{{\hat{X}}_{p}\left( {t;w_{1}} \right)}},} & (33) \end{matrix}$ and then comparing the resulting ratio to a threshold or reference value that, when reached, signifies occurrence of the change that was to be detected.

Comparisons between test and reference time-weighted densities and distributions of the feature signal have been invented to allow the user to quantify differences and detect a wide array of changes in these distributions with great sensitivity and specificity. Further, these comparisons (and those mentioned above for the PTF) have also been implemented in analog form and in highly efficient digital form.

A time-varying signal, referred to as a Λ-estimator, is defined to quantify the difference between distributions by functioning as a type of distance measure between them as $\begin{matrix} \begin{matrix} {{\Lambda\left( {{t;W},G} \right)} = {\Lambda\left( {{F_{1}\left( {t,{x;w}} \right)},{F_{2}\left( {t,{x;w}} \right)}} \right)}} \\ {= {\int_{- \infty}^{\infty}{{W\left( {F_{1}\left( {t,{y;w}} \right)} \right)}{G\left( {{F_{1}\left( {t,{y;w}} \right)} - {F_{2}\left( {t,{y;w}} \right)}} \right)}{\mathbb{d}{F_{1}(y)}}}}} \\ {= {\int_{- \infty}^{\infty}{{W\left( {F_{1}\left( {t,{y;w}} \right)} \right)}{G\left( {{F_{1}\left( {t,{y;w}} \right)} - {F_{2}\left( {t,{y;w}} \right)}} \right)}{f_{1}(y)}{\mathbb{d}y}}}} \end{matrix} & (34) \end{matrix}$ for some percentile weighting function, W, and some spatial weighting function, G.

The Λ-estimator, through choice of weighting functions, is able to quantify a wide array of differences in the two distributions being compared.

For example, consider an estimator of the differences between the foreground and background distributions as follows: $\begin{matrix} {{\Lambda = {\lambda_{\pm} = {\int_{- \infty}^{\infty}{{{W\left\lbrack {F_{bg}(x)} \right\rbrack}\left\lbrack {{F_{bg}(x)} - {F_{fg}(x)}} \right\rbrack}\theta\left\{ {\pm \left\lbrack {{F_{bg}(x)} - {F_{fg}(x)}} \right\rbrack} \right\}{\mathbb{d}{F_{bg}(x)}}}}}},} & (35) \end{matrix}$ where the percentile weighting function W(z) is such that ∫₀¹zW(z)𝕕z = 1, and a pair of spatial weighting functions (giving rise to a pair of estimators, λ_(±)(t),resp.) is given by G_(±)(x)=xθ(±x). The above parameters compute weighted distance between the background and the foreground for specific cases of F_(fg)<F_(bg) and F_(fg)>F_(bg) for λ+ and λ− respectively.

Computing λ± estimators becomes especially easy if the weighting function W(x) is a delta function, ${W(x)} = {\frac{1}{p}{{\delta\left( {x - p} \right)}.}}$ Thus Eq. (35) reduces to $\begin{matrix} {{{\lambda \pm} = {\left\lbrack {1 - {\frac{1}{p}{F_{fg}\left( x_{p} \right)}}} \right\rbrack\theta\left\{ {\pm \left\lbrack {1 - {\frac{1}{p}{F_{fg}\left( x_{p} \right)}}} \right\rbrack} \right\}}},} & (36) \end{matrix}$ where x_(p) is such that F_(bg)(x_(p))=p, i.e., the output of the PTF for p^(th) percentile. Using the fact that F_(fg)[x_(p)(t)]=θ[x_(p)(t)−X(s)]_(T) _(fg) , Eq. (36) becomes $\begin{matrix} {{\lambda \pm (t)} = {{\frac{1}{p}\left\lbrack {p - \left\langle {\theta\left\lbrack {{x_{p}(s)} - {X(s)}} \right\rbrack} \right\rangle_{T_{fg}}} \right\rbrack}\theta\left\{ {\pm \left\lbrack {p - \left\langle {\theta\left\lbrack {{x_{p}(s)} - {X(s)}} \right\rbrack} \right\rangle_{T_{fg}}} \right\rbrack} \right\}}} & (37) \end{matrix}$ where we replaced x_(p)(t) by x_(p)(s) in the assumption that T_(bg)>>T_(fg), and therefore x_(p)(t) changes slowly with respect to X(t).

For example, consider a simple mix of two signals with ${{W(x)} = {2\quad{\delta\left( {x - \frac{1}{2}} \right)}}},{{F_{bg}(x)} = {F(x)}},{{{and}\quad{F_{fg}(x)}} = {{\left( {1 - \alpha} \right){F(x)}} + {\alpha\quad{{F\left( \frac{x}{q} \right)}.}}}}$ That is, the foreground window contains a mix of two signals such that the ratio of their mean values is q. Then $\begin{matrix} {{{\lambda \pm} = {{\alpha\left\lbrack {1 - {2{F\left( \frac{x_{1/2}}{q} \right)}}} \right\rbrack}{\theta\left\lbrack {\pm \left( {q - 1} \right)} \right\rbrack}}},} & (38) \end{matrix}$ where x_(1/2) is such that ${{F\left( x_{1/2} \right)} = \frac{1}{2}},$ i.e., the background median. If lim_(x→0)F(x)=0, and ${{q + \frac{1}{q}} ⪢ 1},{{{{then}\quad 1} - {2{F\left( \frac{x_{1/2}}{q} \right)}}} \approx {{sign}\left( {q - 1} \right)}}$ and  λ±≈±αθ[±(q−1)].  (39) Thus the values of λ± become a measure of fraction of the second component in the foreground window.

The invariance of the Λ estimators given by Eq. (34) to a monotonic transformation (function) of the signal ƒ[X(t)], e.g., a>bƒ(a)>ƒ(b), allows simplification of computations by rescaling the signal to a convenient range, and makes the change detection invariant to non-linear amplification of the raw signal. In combination with a signal preprocessing system which provides methods for taking a raw input signal, measuring desired features or properties of that signal, then transforming the output into (several) signals of amplitudes which characterize the levels of the particular features under study as they evolve over time, the above mentioned tools enable rapid, efficient, and reliable detection of changes in these specific features and tracking of their time evolution.

In both FIGS. 2 and 3, thresholding of the resulting comparison output is performed, as shown in box 32, in order to detect feature changes exceeding a pre-defined value. Where such feature changes are detected, an alarm, whether visual, audible, or otherwise, may be communicated, as shown in box 34.

Step 7: (Optional) Predict Future Changes

Lastly, the present invention's ability to rapidly and accurately detect changes in certain features of an input signal can be used to predict future changes in cases when the detected changes are associated with an increased likelihood of these future changes. For example, when applied to seismic signals, the method can enable prediction of an earthquake or volcanic eruption; when applied to meteorological signals, the method can enable prediction of severe weather; when applied to financial data, the method can enable prediction of an impending price change in a stock; when applied to brain waves or heart signals, the method can enable prediction of an epileptic seizure or ventricular fibrillation; and when applied to brain wave or electromyographic signals, the method can enable prediction of movement of a body part.

EXAMPLE

Financial Analysis

In an exemplary illustration of application of the present invention to financial analysis, a three-dimensional raw input signal, x(t), is received such that, as shown in FIG. 4, x(t) is the price at time t of three stocks (IBM, GM, and MRK) during a 360 minute period on Oct. 23, 1994.

Pre-processing is then performed on x(t) to yield a feature signal, X(t), as shown in FIG. 5, such that X(t) is the value of a portfolio at time t comprising the three stocks of interest: X(t)=300*GM+100*IBM+80*MRK.

Next, as time, t, evolves, the time-weight function, w(t,s), is defined for use at each time point. In the present example, w is defined so that the time-weight is a moving square window of length T=100 minutes. In practice, more complicated time-weights could be used that include a dependence upon an auxiliary signal such as oil prices and supplies which may have a direct impact in GM stock prices by influencing consumer preferences and cash availability. Another time-weight, for example is the average temperature across the U.S. for the past week (thus incorporating information that could have an effect on the feature signal if, e.g., a freeze altered the price of wheat futures or heat wave altered the price of California energy companies) that could directly or indirectly affect these or other stocks. The true 0.25, 0.50, and 0.75 percentiles are shown in FIG. 6 as, respectively, X_(0.25)(t), X_(0.50)(t), and X_(0.75)(t). The true feature density, ƒ(t,w), and distribution, F(t,w), are calculated from the data at two different times, t₁ and t₂, as shown in FIGS. 7 and 8. The parameters are calculated for a time-scale of 100 minutes.

Next, the feature signal and time-weight are used to compute/update an evolving approximation to the time-weighted density and corresponding distribution function of the feature signal: {circumflex over (ƒ)}(t,x;w) and {circumflex over (F)}(t,x;w). In the present example, {circumflex over (ƒ)}(t,x;w₁) and {circumflex over (F)}(t,x;w₁) are evaluated assuming a Gaussian (normal) density approximation (bell-shaped) for the data over the past 100 minutes. These approximations can be compared to the true distributions shown in the previous figure. Again, these were evaluated at two different times, t₁ and t₂, as shown in FIGS. 9 and 10.

The feature signal, a specified set of one or more percentile values, p, and approximations {circumflex over (ƒ)}(t,x;w) and {circumflex over (F)}(t,x;w) are then used to compute/update the PTF output, {circumflex over (X)}_(p)(t;w). It will be appreciated that p may be a vector of multiple percentiles, as in this example where p=[0.25, 0.50, 0.75]. The PTF output, {circumflex over (X)}_(p)(t;w), is shown in FIG. 11.

An interpolation/extrapolation scheme is then used to compute/update a second set of (evolving) approximations to the time-weighted density and corresponding distribution function of the feature signal, ${\hat{\hat{f}}\left( {{t,\quad x};w} \right)}\quad{and}\quad{{\hat{\hat{F}}\left( {{t,\quad x};w} \right)}.}$ In the present example, ${\hat{\hat{f}}\left( {{t,\quad x};w_{1}} \right)}\quad{and}\quad{\hat{\hat{F}}\left( {{t,\quad x};w_{1}} \right)}$ were determined using the outputs of the PTF by linear interpolation. These were again evaluated at the times, t₁ and t₂, as shown in FIGS. 12 and 13.

Then the PTF output and approximations to the time-weighted density/distribution of the feature signal are analyzed to detect, quantify, or predict changes in the system that produced the raw signal. This analysis may consist, for example, of establishing or computing a reference against which to compare the information being generated. One preferred approach is to use a fixed reference value and a fixed density/distribution and compare them to the PTF and the density/distribution

In the present example, the portfolio value on the particular day did not demonstrate any significant change over the background distribution, so the owner may have simply decided to maintain his holdings at that time.

Computer Program

A computer program listing appendix containing the source code of a computer program operable to implement the above-described method is incorporated herein by reference and appended hereto. The computer program comprises a combination of source code segments corresponding to the steps of the method. The combination of computer code segments may be stored on any computer-readable media, such as magnetic disk, magnetic tape, or CD-ROM, and executed by a conventional personal computer or similar computing device. As will be appreciated by one with skill in the programming arts, the combination of source code segments may be written in any suitable programming language.

During execution, one or more of the combination of source code segments will require input, such as the raw input signal, which may be provided by any suitable device, such as an oscilloscope or transducer, or application, such as a spreadsheet, the nature of which will depend upon the nature of the input.

System

FIGS. 15 and 17 show block diagrams of a preferred analog system 100 operable to implement the above-described method. FIGS. 16 and 18 show detailed circuit schematics of a preferred embodiment of the analog system 100 shown described generally in FIGS. 15 and 17. The analog system 100 comprises two major components, an analog PTF circuit 102 and an analog Lambda circuit 104. This implementation is based upon a recognition that the use of approximations in determining feature density facilitate tracking of approximations, respectively. A second preferred approach involves performing the prior method steps simultaneously with two differing choices of time-weight function, one to establish a reference PTF and density/distribution approximation and the other to generate a test PTF and density/distribution approximation, then comparing the two resulting sets of information. Described above is a method for comparing two PTF outputs (e.g., computing their ratio) and for comparing test-to-reference distributions (Λ-estimators). The ratio and/or Λ-estimators are used to compare the feature content in one time-window/scale to another. Changes may be detected, e.g., by applying thresholds to either ratio and/or Λ-estimators. In the present example, the above calculations were performed on short time-scale of 100 min. The long time-scale calculations were performed using the portfolio variations starting from 1980 until 2001 with a time-scale of T=1 year. This was taken as reference for the calculation of the Λ parameter. Thus, a simple difference between ${\hat{\hat{F}}(t)},$ evaluated for a T=100 min and ${\hat{\hat{F}}}_{REF},$ evaluated with a time-scale of T=1 year was used for Λ(t), as shown in FIG. 14.

It should be noted that the Λ(t) signal on the 100 minute time scale was unaffected by the more brief outlier spike that occurred in the feature signal approximately 260 minutes into the day's trading.

Lastly, once features of the financial system from which the raw signal was measured have been detected and quantified, the output may be utilized. One such use of this information is signal normalization (of any signal) with respect to any of the distribution approximations made available by the present invention. Another use involves prediction of future changes if it happens that the detected changes are associated with an increased likelihood of certain future signal changes. the percentile in real-time with minimal errors. The use of a uniform density distribution makes the implementation simpler by an order of magnitude over implementations involving distributions with exponentiation, while providing and output that closely tracks the actual median obtained by sorting. The implementation outputs the percentile value of the input signal in real time while retaining the controllability and flexibility of a digital algorithm.

Referring first to FIG. 15, the analog PTF circuit 102 broadly includes a peak detector stage 108; a comparator stage 110; a scaling and shifting amplifier stage 112; an adder stage 114; a multiplier and divider stage 116; and an integrator stage 118.

The peak detector stage 108 determines the peak of an incoming signal. For a uniform distribution, the density function ƒ(t, w) is given by 1/(b−a), where b(t) and a(t) are the maximum and the minimum of the signal respectively. Thus, for a=0 (this can be achieved using the optional preprocessing step), the peak detector stage 108 gives 1/{circumflex over (ƒ)}.

The comparator stage 110 performs the step of computing: θ└X(s)−X_(p)(s)┘. The output of the comparator stage 110 is a voltage equal to a saturation voltage (±15 V) of an amplifier component of the comparator stage 110.

The scaling and shifting amplifier stage 112 brings the voltage to 0-10 V. This enables direct subtraction from the input 10*p in the adder 114.

The adder stage 114 subtracts the output of the scaling and shifting amplifier stage 112 from 10*p. Thus the output of the adder stage 114 is 10*(p−θ└X(s)−X_(p)(s)┘).

The multiplier and divider stage 116 multiplies the output of the adder stage 114 and divides the result by 10. Thus the output of this stage 116 is $\frac{1}{\hat{f}}\left( {p - {\theta\left\lbrack {{X(s)} - {X_{p}(s)}} \right\rbrack}} \right),\quad{which}\quad{is}\quad T{{{\overset{.}{X}}_{p}(t)}.}$

The integrator stage 118 has an input-output relationship defined by the following equation: $V_{o} = {\frac{1}{RC}{\int_{- \infty}^{t}{V_{i}\quad{\mathbb{d}t},}}}$ where Vi and V_(o) are the input and the output respectively. Thus the output of this stage 118 is $\frac{1}{RC}{{{TX}_{p}(t)}.}$ Choosing proper values for R and C will give us an output that is equal to X_(p)(t).

Referring also to FIG. 16, the peak detector stage 108 has a natural exponential forgetting factor due to discharging of the capacitor C_(p). The time-window of exponential forgetting for the peak can be controlled by varying the resistor R_(p). The time-window over which the percentile is calculated, is controlled by the integrator stage 118. Resistor R_(i) and a capacitor C_(i) of the integrator stage 110 control the time factor T. By tuning these parameters, R_(p), C_(p), R_(i) and C_(i), the PTF circuit 102 can be tuned to approximate a percentile filter with specific properties. For example, by choosing the following values: R_(p)=1.0 MΩ, C_(p)=2.2 μF, R_(i)=1.0 MΩ, and C_(i)=2.2 μF, there is achieved an exponential forgetting time constant of 2.2 seconds and a percentile time-window of 2.2 seconds.

The output of the PTF circuit 102 with these parameters to an example feature signal input (shown in FIG. 17A) is shown in FIG. 17B. Also shown in FIG. 17B is the true median obtained by performing a heap sort of sliding 2.2-second window on the input data. Note that the PTF circuit 102 responds to changes in the signal faster than the true median. This is because the true N-sample median does not respond until N/2 (or [N+1]/2 if N is odd) samples have passed through the filter. However, due to the implementation of the PTF using exponential forgetting, it responds to changes almost instantaneously. This property of the PTF is valuable when attempting to detect rapid signal amplitude changes.

Referring to FIG. 18, the analog Lambda circuit 104 broadly comprises a bank 122 of PTF circuits 102; a bank 124 of reference signals; an adder stage 126; a thresholding stage 128; and an alarm stage 130.

The bank 122 of PTF circuits 102 comprises one or more PTF circuits 102, each applied on the original signal, x(t) or feature signal X(t). The output of this bank 122 is the calculation of F_(fg) (Eq. 35).

The bank 124 of reference signals can be PTF circuits 102 applied to the original raw input or to the feature signal. In such a case, the reference signals are typically generated by using large time-scales during the integration step of the PTF operation. Otherwise, the reference signals can be simple constant voltage sources. There is a reference signal corresponding to each of the PTF circuits 102 in the above bank 122. The output of this bank 124 is the F_(bg).

The adder stage 126 adds the output of the bank 122 of PTF circuits 102 to the negative output of the bank 124 of reference signals. This stage 126 can also selectively amplify or attenuate the result of each subtraction. Thus the output of the adder stage 126 is a summation of the weighted difference between the PTF circuit 102 output signal and the reference signal, which is the Lambda parameter: Λ(t)=Σw(t,x)(F _(fg)(t,x)−F _(bg)(t,x)).  (40) w(t,x) can be selected to give a parameter of choice.

The thresholding stage 128 detects increases in the Lambda parameter beyond a particular threshold. This stage 128 may be implemented as a comparator.

The alarm stage 130 communicates threshold crossing detected by the thresholding stage 128, and can be implemented as in many different ways, from a simple light (or beep) to a complicated circuit that can perform a sequence of steps, such as a computer that can perform some pre-determined operation.

Referring also to FIG. 19, an analog Lambda circuit is 104 shown operable to compute the Λ parameters from the percentiles of the input signal and constant reference signals. The inputs to the analog Lambda circuit 104 are the outputs PTF₁, PTF₂, and PTF₃ provided by parallel PTF circuits 102. PTF₁, PTF₂, and PTF₃ correspond to the p₁, p₂ and p₃ percentile of the input signal such that p₁>p₂>p₃. The reference signals in the circuit 104 are Vr₁, Vr₂, and Vr₃ such that Vr₁>Vr₂>Vr₃. The Lambda circuit 104 comprises first and second stages 134,136, wherein the first stage 134 is operable to provide the calculated Λ parameter, and the second stage 136 is operable to perform threshold detection and alarm.

The following equations hold for the Lambda circuit 104 shown: $\begin{matrix} {{V_{\Lambda} = {{{R_{p}\left( {1 + \frac{R_{6}}{R_{5}}} \right)}\left\lbrack {\frac{{PTF}_{1} - {Vr}_{1}}{R_{9}} + \frac{{PTF}_{2} - {Vr}_{2}}{R_{8}} + \frac{{PTF}_{3} - {Vr}_{3}}{R_{7}}} \right\rbrack},}}{Where}} & (41) \\ {R_{p} = {\frac{R_{7}R_{8}R_{9}}{{R_{7}R_{8}} + {R_{8}R_{9}} + {R_{7}R_{9}}}\quad.}} & (42) \end{matrix}$

The Lambda circuit 104 can be tuned to output a particular parameter by changing the values of resistances R₅-R₉. For example, if the circuit 104 is to respond to changes in the p₁ percentile (say the 75^(th) percentile), then the gain of that particular input line can be increased while the other two input lines can be attenuated. In the second stage 136, this voltage can be compared to a specific threshold and an alarm can be triggered.

The present invention, as described herein, provides computationally efficient characterization of temporally-evolving densities and distributions of signal features of arbitrary-type signals in a moving time window by tracking output of order statistic (e.g., percentile, quantile, rank-order) filters. As noted, the present invention's ability to rapidly and accurately detect changes in certain features of an input signal can also enable prediction in cases when the detected changes are associated with an increased likelihood of certain of future signal changes.

Although the invention has been described with reference to the preferred embodiment illustrated in the attached drawings, it is noted that equivalents may be employed and substitutions made herein without departing from the scope of the invention as recited in the claims. Those skilled in the art will appreciate, for example, that although described herein for use with a continuous-time signal, time-weighting can be equally well applied to a discrete-time signal. Thus, the present invention can be implemented in both digital and analog forms.

One skilled in the relevant art will also recognize that any sequence of data, one- or multi-dimensional, resulting from any measurement, may be used as a signal in the present invention. This extends the applicability of the invention beyond the most commonly used definition of a signal, in which the data is parameterized by an index, t, that is interpreted as a time variable, to allow t to be any element of an ordered set. In this event, t is interpreted simply as an index that determines the order in which the data appears in the list, {x(t)}, or its structure. This enhances the understanding of how the invention may be utilized in the analysis of lists or sequences. Specific illustrative examples include analysis of word lists such as those found in a document, enabling the quantification of document content, useful, e.g., in electronic search engine applications; as well as analysis of biologic sequences, structures, or compounds at the molecular, microscopic, or macroscopic level, useful, e.g., in comparison of genetic makeup of a sample to a reference. Similar applications exist to non-biologic sequences, structures or compounds.

Having thus described the preferred embodiment of the invention, what is claimed as new and desired to be protected by Letters Patent includes the following: 

1. A method of detecting a change in at least one feature of an input signal, the method comprising the steps of: (a) receiving the input signal; (b) determining at least one time-weighted cumulative distribution function of the input signal; (c) comparing the time-weighted cumulative distribution function to a reference function in order to detect the change in the feature of the input signal; (d) communicating detection of the change in the feature; and (e) using the detected change in the feature to predict a future change in the input signal.
 2. The method as set forth in claim 1, wherein the input signal is of arbitrary type, origin, scale, and degree of complexity.
 3. The method as set forth in claim 1, wherein the input signal is selected from the group consisting of: continuous-time signals, discrete-time signals, analog signals, digital signals, scalar signals, multi-dimensional signals, deterministic signals, stochastic signals, stationary signals, non-stationary signals, linear signals, and nonlinear signals.
 4. The method as set forth in claim 1, wherein the input signal is selected from the group consisting of: biological signals, financial signals, physical signals, communication signals, mechanical signals, chemical signals, sequences of measured data, and lists of measured data.
 5. The method as set forth in claim 1, wherein step (a) includes preprocessing the input signal to derive a feature signal, wherein the feature signal is thereafter used in place of the input signal.
 6. The method as set forth in claim 5, wherein the feature signal is multi-dimensional, with each dimension being representative of a level of a particular feature of the input signal.
 7. The method as set forth in claim 6, wherein the particular feature of the input signal is selected from the group consisting of: derivatives, integrals, moments, wavespeed, signal power in a time window, signal power in a particular frequency band, frequency domain features, time domain features, measures from nonlinear dynamics, measures of rythmicity, wave shape, and amplitude.
 8. The method as set forth in claim 1, wherein the time-weighted cumulative distribution function is determined from at least one function selected from the group consisting of: time-weighted density functions, time-weighted feature density functions, time-dependent feature density functions, modulated threshold density functions, time-weighted modulated threshold density functions, time-dependent modulated threshold density functions, time-weighted amplitude density functions, time-dependent amplitude density functions, time-weighted counting density functions, time-dependent counting density functions, time-weighted threshold crossing density functions, time-dependent threshold crossing density functions, time-weighted acceleration density functions, time-dependent acceleration density functions.
 9. The method as set forth in claim 1, wherein the time-weighted cumulative distribution function is determined using a foreground moving time window of the input signal.
 10. The method as set forth in claim 1, wherein the time-weighted cumulative distribution function depends upon at least one other auxiliary signal.
 11. The method as set forth in claim 10, wherein the auxiliary signal may be determined from the input signal.
 12. The method as set forth in claim 1, wherein the time-weighted cumulative distribution function utilizes exponential forgetting.
 13. The method as set forth in claim 1, wherein the time-weighted cumulative distribution function is determined parametrically.
 14. The method as set forth in claim 1, wherein the time-weighted cumulative distribution function is determined by first determining at least one parameter upon which the time-weighted cumulative distribution function depends and where the time-weighted cumulative distribution function is selected from the group consisting of: Gaussian distributions, Chi-square distributions, Uniform distributions, Exponential distributions, Beta distributions, and Triangle distributions.
 15. The method as set forth in claim 1, wherein the time-weighted cumulative distribution function is determined non-parametrically.
 16. The method as set forth in claim 1, wherein the time-weighted cumulative distribution function is determined by interpolation from a plurality of percentile values of a second time-weighted cumulative distribution function.
 17. The method as set forth in claim 1, wherein the time-weighted cumulative distribution function is determined by extrapolation from a plurality of percentile values of a second time-weighted cumulative distribution function.
 18. The method as set forth in claim 1, wherein the reference function is a second time-weighted cumulative distribution function determined from a background moving time window of the input signal.
 19. The method as set forth in claim 1, wherein step (c) further includes quantifying the change in the feature.
 20. The method as set forth in claim 1, wherein step (c) is performed in real time.
 21. A system for detecting a change in at least one feature of an input signal, the system comprising circuitry operable to: receive the input signal; determine at least one time-weighted cumulative distribution function of the input signal; compare the time-weighted cumulative distribution function to a reference function in order to detect the change in the feature of the input signal; and communicate detection of the change in the feature; wherein the detected change in the feature is used to predict a future change in the input signal.
 22. The method as set forth in claim 1, wherein step (e) includes using the detected change in the feature to control a process.
 23. The method as set forth in claim 1, wherein step (e) includes using the detected change in the feature to recognize the presence of a pattern in a particular feature of the input signal.
 24. The system as set forth in claim 21, wherein the input signal is of arbitrary type, origin, scale, and degree of complexity.
 25. The system as set forth in claim 21, wherein the input signal is selected from the group consisting of: continuous-time signals, discrete-time signals, analog signals, digital signals, scalar signals, multi-dimensional signals, deterministic signals, stochastic signals, stationary signals, non-stationary signals, linear signals, and nonlinear signals.
 26. The system as set forth in claim 21, wherein the input signal is selected from the group consisting of: biological signals, financial signals, physical signals, communication signals, mechanical signals, chemical signals, sequences of measured data, and lists of measured data.
 27. The system as set forth in claim 21, wherein the circuitry is further operable to preprocess the input signal to derive a feature signal, wherein the feature signal may thereafter be used in place of the input signal.
 28. The system as set forth in claim 27, wherein the feature signal is multi-dimensional, with each dimension being representative of a level of a particular feature of the input signal.
 29. The system as set forth in claim 28, wherein the particular feature of the input signal is selected from the group consisting of: derivatives, integrals, moments, wavespeed, signal power in a time window, signal power in a particular frequency band, frequency domain features, time domain features, measures from nonlinear dynamics, measures of rythmicity, wave shape, and amplitude.
 30. The method as set forth in claim 21, wherein the circuitry is further operable to quantify the change in the feature.
 31. The method as set forth in claim 21, wherein the detected change in the feature is used to control a process.
 32. The method as set forth in claim 21, wherein the detected change in the feature is used to recognize the presence of a pattern in a particular feature of the input signal.
 33. The method as set forth in claim 21, wherein the time-weighted cumulative distribution function is determined using exponential forgetting. 